n,k=map(int,(input().split()))
l=list(map(int,(input().split())))
rem=n%l[0]
quo=n//l[0]
no=0
n1=1
for i in l:
no+=1
if(rem>n%i):
rem=n%i
n1=no
quo=n//i
print(n1,quo)#include <bits/stdc++.h>
using namespace std;
const long long N = LLONG_MAX;
int main()
{
long long n, k;
cin >> n >> k;
vector<long long> v;
for(int i = 0; i < k; i++)
{
long long x;
cin >> x;
v.push_back(x);
}
long long indx = -1, b = N;
for(long long i = 0; i < k; i++)
{
long long a = n % v[i];
if(a < b)
{
indx = i;
b = a;
}
}
cout << indx + 1 << " " << n / v[indx] << endl;
return 0;
}383. Ransom Note | 242. Valid Anagram |
141. Linked List Cycle | 21. Merge Two Sorted Lists |
203. Remove Linked List Elements | 733. Flood Fill |
206. Reverse Linked List | 83. Remove Duplicates from Sorted List |
116. Populating Next Right Pointers in Each Node | 145. Binary Tree Postorder Traversal |
94. Binary Tree Inorder Traversal | 101. Symmetric Tree |
77. Combinations | 46. Permutations |
226. Invert Binary Tree | 112. Path Sum |
1556A - A Variety of Operations | 136. Single Number |
169. Majority Element | 119. Pascal's Triangle II |
409. Longest Palindrome | 1574A - Regular Bracket Sequences |
1574B - Combinatorics Homework | 1567A - Domino Disaster |
1593A - Elections | 1607A - Linear Keyboard |
EQUALCOIN Equal Coins | XOREQN Xor Equation |
MAKEPAL Weird Palindrome Making | HILLSEQ Hill Sequence |